GATE CSE 1997
Q21.
Which of the following languages over \left\{a,b,c\right\} is accepted by a deterministic pushdown automata?Q22.
A priority queue Q is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT (Q,C,K) where K is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN (Q). For a sequence of operations, the keys chosen are inQ24.
Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as substring?Q25.
A partial order \leq is defined on the set S=\left \{ x, a_1, a_2, \ldots, a_n, y \right \} \text{ as }x \leq _{i} a_{i} for all i and a_{i}\leq y for all i, where n \geq 1. The number of total orders on the set S which contain the partial order \leq isQ28.
A language L allows declaration of arrays whose sizes are not known during compilation. It is required to make efficient use of memory. Which one of the following is true?Q29.
Which of the following is essential for converting an infix expression to the postfix form efficiently?